Analysis of matches and partial-matches in a Danish STR data set

Partial Matches and theInterpretation of

Do Weave Matches Imply Canvas Roll Matches?

Computational algorithms for measuring thread counts from scanned x-rays produce warp and weft thread count “maps” across entire paintings. Within the database of over 300 van Gogh paintings, we found a clique of 44 warp-weave-matched paintings. By reconstructing the smallest canvas section that could have produced this match, they must span the entire width of a commercial canvas roll (2+ mete...

Incorporating partial matches within multiobjective pharmacophore identification

This paper describes the extension of our earlier multi-objective method for generating plausible pharmacophore hypotheses to incorporate partial matches. Diverse sets of molecules rarely adopt exactly the same binding mode, and so allowing the identification of partial matches allows our program to be applied to larger and more diverse datasets. The method explores the conformational space of ...

PMPM: Prediction by Combining Multiple Partial Matches

The prediction by partial matching (PPM) algorithm has been well known for its high prediction accuracy. Recent proposals of PPM-like predictors confirm its effectiveness on branch prediction. In this paper, we introduce a new branch prediction algorithm, named Prediction by combining Multiple Partial Matches (PMPM). The PMPM algorithm selectively combines multiple matches instead of using the ...

Scalable Web Service Composition with Partial Matches

We will investigate scalable algorithms for automated Semantic Web Service Composition (WSC). Our notion of WSC is very general: it allows the generation of new constants by Web service outputs; the composition semantics includes powerful background ontologies; and we use the most general notion of matching, partial matches, where several services can cooperate each covering only a part of a re...